Hybrid static/dynamic scheduling for already optimized dense matrix factorization

We present the use of a hybrid static/dynamic scheduling strategy of the task dependency graph for direct methods used in dense numerical linear algebra. This strategy provides a balance of data locality, load balance, and low dequeue overhead. We show that the usage of this scheduling in communication avoiding dense factorization leads to significant performance gains. On a 48 core AMD Opteron NUMA machine, our experiments show that we can achieve up to 64% improvement over a version of CALU that uses fully dynamic scheduling, and up to 30% improvement over the version of CALU that uses fully static scheduling. On a 16-core Intel Xeon machine, our hybrid static/dynamic scheduling approach is up to 8% faster than the version of CALU that uses a fully static scheduling or fully dynamic scheduling. Our algorithm leads to speedups over the corresponding routines for computing LU factorization in well known libraries. On the 48 core AMD NUMA machine, our best implementation is up to 110% faster than MKL, while on the 16 core Intel Xeon machine, it is up to 82% faster than MKL. Our approach also shows significant speedups compared with PLASMA on both of these systems

Domain-decomposed preconditionings for transport operators

The performance was tested of five different interface preconditionings for domain decomposed convection diffusion problems, including a novel one known as the spectral probe, while varying mesh parameters, Reynolds number, ratio of subdomain diffusion coefficients, and domain aspect ratio. The preconditioners are representative of the range of practically computable possibilities that have appeared in the domain decomposition literature for the treatment of nonoverlapping subdomains. It is shown that through a large number of numerical examples that no single preconditioner can be considered uniformly superior or uniformly inferior to the rest, but that knowledge of particulars, including the shape and strength of the convection, is important in selecting among them in a given problem

Kepler eclipsing binary stars. VII. the catalogue of eclipsing binaries found in the entire Kepler data set

The primary Kepler Mission provided nearly continuous monitoring of ~200,000 objects with unprecedented photometric precision. We present the final catalog of eclipsing binary systems within the 105 deg2 Kepler field of view. This release incorporates the full extent of the data from the primary mission (Q0-Q17 Data Release). As a result, new systems have been added, additional false positives have been removed, ephemerides and principal parameters have been recomputed, classifications have been revised to rely on analytical models, and eclipse timing variations have been computed for each system. We identify several classes of systems including those that exhibit tertiary eclipse events, systems that show clear evidence of additional bodies, heartbeat systems, systems with changing eclipse depths, and systems exhibiting only one eclipse event over the duration of the mission. We have updated the period and galactic latitude distribution diagrams and included a catalog completeness evaluation. The total number of identified eclipsing and ellipsoidal binary systems in the Kepler field of view has increased to 2878, 1.3% of all observed Kepler targets